GKD: Semi-supervised Graph Knowledge Distillation for Graph-Independent Inference

نویسندگان

چکیده

The increased amount of multi-modal medical data has opened the opportunities to simultaneously process various modalities such as imaging and non-imaging gain a comprehensive insight into disease prediction domain. Recent studies using Graph Convolutional Networks (GCNs) provide novel semi-supervised approaches for integrating heterogeneous while investigating patients’ associations prediction. However, when meta-data used graph construction is not available at inference time (e.g., coming from distinct population), conventional methods exhibit poor performance. To address this issue, we propose approach named GKD based on knowledge distillation. We train teacher component that employs label-propagation algorithm besides deep neural network benefit non-graph only in training phase. embeds all information soft pseudo-labels. pseudo-labels are then student unseen test which modality unavailable. perform our experiments two public datasets diagnosing Autism spectrum disorder, Alzheimer’s disease, along with thorough analysis synthetic datasets. According these experiments, outperforms previous graph-based learning terms accuracy, AUC, Macro F1.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supervised Bipartite Graph Inference

We formulate the problem of bipartite graph inference as a supervised learning problem, and propose a new method to solve it from the viewpoint of distance metric learning. The method involves the learning of two mappings of the heterogeneous objects to a unified Euclidean space representing the network topology of the bipartite graph, where the graph is easy to infer. The algorithm can be form...

متن کامل

Supervised Graph Inference

We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learning of a mapping of the vertices to a Euclidean space where the graph is easy to infer, and can be formulated as an optimization problem in a reproducing kernel Hilbert space. We report encouraging results on the proble...

متن کامل

Graph-Based Semi-Supervised Learning

While labeled data is expensive to prepare, ever increasing amounts of unlabeled data is becoming widely available. In order to adapt to this phenomenon, several semi-supervised learning (SSL) algorithms, which learn from labeled as well as unlabeled data, have been developed. In a separate line of work, researchers have started to realize that graphs provide a natural way to represent data in ...

متن کامل

Combining Graph Laplacians for Semi-Supervised Learning

A foundational problem in semi-supervised learning is the construction of a graph underlying the data. We propose to use a method which optimally combines a number of differently constructed graphs. For each of these graphs we associate a basic graph kernel. We then compute an optimal combined kernel. This kernel solves an extended regularization problem which requires a joint minimization over...

متن کامل

Graph Construction for Semi-Supervised Learning

Semi-Supervised Learning (SSL) techniques have become very relevant since they require a small set of labeled data. In this scenario, graph-based SSL algorithms provide a powerful framework for modeling manifold structures in high-dimensional spaces and are effective for the propagation of the few initial labels present in training data through the graph. An important step in graph-based SSL me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-87240-3_68